Language Complexity of Rotations and Sturmian Sequences
نویسندگان
چکیده
Given a rotation of the circle, we study the complexity of formal languages that are generated by the itineraries of interval covers. These languages are regular iff the rotation is rational. In the case of irrational rotations, our study reduces to that of the language complexity of the corresponding Sturmian sequences. We show that for a large class of irrationals, including e, all quadratic numbers and more generally all Hurwitz numbers, the corresponding languages can be recognized by a nondeterministic Turing machine in linear time (in other words, belongs to NLIN). @ 1998-Elsevier Science B.V. All rights reserved
منابع مشابه
Maximal pattern complexity for discrete systems
For an infinite word α = α0α1α2 · · · over a finite alphabet, Kamae introduced a new notion of complexity called maximal pattern complexity defined by pα(k) := sup τ ]{αn+τ(0)αn+τ(1) · · ·αn+τ(k−1); n = 0, 1, 2, · · · } where the supremum is taken over all sequences of integers 0 = τ(0) < τ(1) < · · · < τ(k − 1) of length k. Kamae proved that α is aperiodic if and only if pα(k) ≥ 2k for every k...
متن کاملInteractions between Dynamics, Arithmetics and Combinatorics: the Good, the Bad, and the Ugly
The aim of this paper is to survey possible generalizations of the well-known interaction between Sturmian sequences and rotations of T1, using the Euclid algorithm of continued fraction approximation. We investigate mainly similar relations between Arnoux-Rauzy sequences and rotations of T2, between codings of Z2-actions on T1 and multidimensional Sturmian sequences, between exchanges of inter...
متن کاملWeak mixing and eigenvalues for Arnoux-Rauzy sequences
— We define by simple conditions two wide subclasses of the socalled Arnoux-Rauzy systems; the elements of the first one share the property of (measure-theoretic) weak mixing, thus we generalize and improve a counterexample to the conjecture that these systems are codings of rotations; those of the second one have eigenvalues, which was known hitherto only for a very small set of examples. Résu...
متن کاملTilings and rotations on the torus: a two-dimensional generalization of Sturmian sequences
We study a two dimensional generalization of Stur-mian sequences corresponding to an approximation of a plane: these sequences are deened on a three-letter alphabet and code a two dimensional tiling obtained by projecting a discrete plane. We show that these sequences code a Z 2-action generated by two rotations on the unit circle. We rst deduce a new way of computing the rectangle complexity f...
متن کاملSequences with grouped factors
We deene a new class of sequences, sequences with grouped factors, in which all factors of a given length occur consecutively at some position. This class contains periodic sequences, Sturmian sequences, but also sequences with maximal complexity. As a particular case, we obtain a new characteristic property of Sturmian words.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Theor. Comput. Sci.
دوره 209 شماره
صفحات -
تاریخ انتشار 1998